Conjugate Codes and Applications to Cryptography
نویسنده
چکیده
A conjugate code pair is defined as a pair of linear codes such that one contains the dual of the other. The conjugate code pair represents the essential structure of the corresponding Calderbank-Shor-Steane (CSS) quantum code. It is argued that conjugate code pairs are applicable to quantum cryptography in order to motivate studies on conjugate code pairs.
منابع مشابه
Concatenated Conjugate Codes
A conjugate code pair is defined as a pair of linear codes either of which contains the dual of the other. A conjugate code pair represents the essential structure of the corresponding Calderbank-Shor-Steane (CSS) quantum code. It is known that conjugate code pairs are applicable to (quantum) cryptography. We give a construction method for efficiently decodable conjugate code pairs.
متن کاملConstructive Conjugate Codes for Quantum Error Correction and Cryptography
A conjugate code pair is defined as a pair of linear codes either of which contains the dual of the other. A conjugate code pair represents the essential structure of the corresponding Calderbank-Shor-Steane (CSS) quantum error-correcting code. It is known that conjugate code pairs are applicable to quantum cryptography. In this work, a polynomial construction of conjugate code pairs is present...
متن کاملA new security proof for FMNV continuous non-malleable encoding scheme
A non-malleable code is a variant of an encoding scheme which is resilient to tampering attacks. The main idea behind non-malleable coding is that the adversary should not be able to obtain any valuable information about the message. Non-malleable codes are used in tamper-resilient cryptography and protecting memories against tampering attacks. Many different types of non-malleability have alre...
متن کاملCover-Free Families and Superimposed Codes: Constructions, Bounds, and Applications to Cryptography and Group Testing
This paper deals with (s, `)-cover-free families or superimposed (s, `)-codes. They generalize the concept of superimposed s-codes and have several applications for cryptography and group testing. We present a new asymptotic bound on the rate of optimal codes and develop some constructions.
متن کاملMinimum Distance of Concatenated Conjugate Codes for Cryptography and Quantum Error Correction
A polynomial construction of error-correcting codes for secure and reliable information transmission is presented. The constructed codes are essentially Calderbank-Shor-Steane (CSS) quantum codes, and hence are also useful for quantum error correction. The asymptotic relative minimum distance of these codes is evaluated, and shown to be larger than that of the codes constructed by Chen, Ling, a...
متن کامل